Optimized Noisy Network Coding for Gaussian Relay Networks
نویسندگان
چکیده
In this paper, we provide an improved lower bound on the rate achieved by noisy network coding in arbitrary Gaussian relay networks, whose gap to the cutset upper bound depends on the network not only through the total number of nodes but also through the degrees of freedom of the min cut of the network. We illustrate that for many networks this refined lower bound can lead to a better approximation of the capacity. The improvement is based on a judicious choice of the quantization resolutions at the relays.
منابع مشابه
Achievable rates for relay networks using superposition coding
We investigate the superposition strategy and its usefulness in terms of achievable information theoretic rates. The achievable rate of the superposition of block Markov encoding (decode-forward) and side information encoding (compress-forward) for the three-node Gaussian relay channel is analyzed. It is generally believed that the superposition can out perform decode-forward or compress-forwar...
متن کاملIeee Information Theory Society Newsletter President's Column from the Editor It Society Member Honored Scholar One Website for Ieee Transactions on Information Theory Has Gone Live Throughput and Capacity Regions Coding for Noisy Networks
Network information theory aims to establish the limits on information fl ow in noisy networks and the coding schemes that achieve these limits. Although a general theory is yet to be developed, several coding schemes and bounds on the capacity have been developed. This article reviews these results with emphasis on two recently developed coding schemes—noisy network coding and compute–forward....
متن کاملDistributed Decode-Forward for Relay Networks
A new coding scheme for general N -node relay networks is presented for unicast, multicast, and broadcast. The proposed distributed decode–forward scheme combines and generalizes Marton coding for single-hop broadcast channels and the Cover–El Gamal partial decode–forward coding scheme for 3-node relay channels. The key idea of the scheme is to precode all the codewords of the entire network at...
متن کاملOn Compress-Forward without Wyner-Ziv Binning for Relay Networks
Noisy network coding is recently proposed for the general multi-source network by Lim, Kim, El Gamal and Chung. This scheme builds on compress-forward (CF) relaying but involves three new ideas, namely no Wyner-Ziv binning, relaxed simultaneous decoding and message repetition. In this paper, using the two-way relay channel as the underlining example, we analyze the impact of each of these ideas...
متن کاملPower Allocation Strategies in Block-Fading Two-Way Relay Networks
This paper aims at investigating the superiority of power allocation strategies, based on calculus of variations in a point-to-point two-way relay-assisted channel incorporating the amplify and forward strategy. Single and multilayer coding strategies for two cases of having and not having the channel state information (CSI) at the transmitters are studied, respectively. Using the notion of cal...
متن کامل